github.com/andybalholm/brotli.histogramPair.cost_diff (field)

29 uses

	github.com/andybalholm/brotli (current package)
		cluster.go#L15: 	cost_diff  float64
		cluster.go#L19: 	if p1.cost_diff != p2.cost_diff {
		cluster.go#L20: 		return p1.cost_diff > p2.cost_diff
		cluster_command.go#L17: 	p.cost_diff = p.cost_combo
		cluster_command.go#L30: 	p.cost_diff = 0.5 * clusterCostDiff(uint(cluster_size[idx1]), uint(cluster_size[idx2]))
		cluster_command.go#L31: 	p.cost_diff -= out[idx1].bit_cost_
		cluster_command.go#L32: 	p.cost_diff -= out[idx2].bit_cost_
		cluster_command.go#L45: 			threshold = brotli_max_double(0.0, pairs[0].cost_diff)
		cluster_command.go#L51: 		if cost_combo < threshold-p.cost_diff {
		cluster_command.go#L58: 		p.cost_diff += p.cost_combo
		cluster_command.go#L94: 		if pairs[0].cost_diff >= cost_diff_threshold {
		cluster_distance.go#L19: 	p.cost_diff = p.cost_combo
		cluster_distance.go#L32: 	p.cost_diff = 0.5 * clusterCostDiff(uint(cluster_size[idx1]), uint(cluster_size[idx2]))
		cluster_distance.go#L33: 	p.cost_diff -= out[idx1].bit_cost_
		cluster_distance.go#L34: 	p.cost_diff -= out[idx2].bit_cost_
		cluster_distance.go#L47: 			threshold = brotli_max_double(0.0, pairs[0].cost_diff)
		cluster_distance.go#L53: 		if cost_combo < threshold-p.cost_diff {
		cluster_distance.go#L60: 		p.cost_diff += p.cost_combo
		cluster_distance.go#L96: 		if pairs[0].cost_diff >= cost_diff_threshold {
		cluster_literal.go#L19: 	p.cost_diff = p.cost_combo
		cluster_literal.go#L32: 	p.cost_diff = 0.5 * clusterCostDiff(uint(cluster_size[idx1]), uint(cluster_size[idx2]))
		cluster_literal.go#L33: 	p.cost_diff -= out[idx1].bit_cost_
		cluster_literal.go#L34: 	p.cost_diff -= out[idx2].bit_cost_
		cluster_literal.go#L47: 			threshold = brotli_max_double(0.0, pairs[0].cost_diff)
		cluster_literal.go#L53: 		if cost_combo < threshold-p.cost_diff {
		cluster_literal.go#L60: 		p.cost_diff += p.cost_combo
		cluster_literal.go#L96: 		if pairs[0].cost_diff >= cost_diff_threshold {